Testing the Effect of different Switch Box Architectures on Detailed Routing in FPGA
نویسندگان
چکیده
FPGA detailed routing problem is an interesting problem in VLSI field because of the limited routing resources in island style FPGA architectures. In this paper, the effectiveness of various switch boxes (Subset, Wilton and Universal) in FPGA detailed routing has been tested using a Boolean satisfiability (SAT) based approach. A SAT instance is formulated for each routing problem and routability is tested using a back-end SAT solver. The performances of different switches have been tested and compared in terms of routability and minimum channel width.
منابع مشابه
Not Necessarily More Switches More Routability
It has been observed experimentally that the mapping of global to detailed routing in conventional FPGA routing architecture (2D array) yields unpredictable results. In [8,10,13], a different class of FPGA structures called Greedy Routing Architectures (GRAs), where a locally optimal switch box routing can be extended to an optimal entire chip routing, were investigated. It was shown that GRAs ...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملRouting Algorithms and Architectures for Field-Programmable Gate Arrays
Field-Programmable Gate Arrays (FPGAs) are a new type of user-programmable integrated circuits that supply designers with inexpensive, fast access to customized VLSI. A key component in the design of an FPGA is its routing architecture, which comprises the wiring segments and routing switches that interconnect the FPGA’s logic cells. Each of the user-programmable switches in an FPGA consumes si...
متن کاملمدل عملکردی تحلیلی FPGA برای پردازش با قابلیت پیکربندی مجدد
Optimizing FPGA architectures is one of the key challenges in digital design flow. Traditionally, FPGA designers make use of CAD tools for evaluating architectures in terms of the area, delay and power. Recently, analytical methods have been proposed to optimize the architectures faster and easier. A complete analytical power, area and delay model have received little attention to date. In addi...
متن کاملA Detailed Router for Field-Programmable Gate Arrays
This paper describes a new kind of detailed routing algorithm that has been designed specifically for field-programmable gate arrays (FPGA’s). The algorithm is unique in that it approaches this problem in a general way, allowing it to be used over a wide range of different FPGA routing architeetures. The detailed routing of FPGA’s is a new problem and can be more difficult than classic detailed...
متن کامل